Octahedral extensions with a given cubic subfield
نویسندگان
چکیده
منابع مشابه
Computing all elements of given index in sextic fields with a cubic subfield
There are no general methods for calculating elements of given index in sextic fields. This problem was investigated only in sextic fields having quadratic subfields. In the present paper we give an algorithm to compute all elements of given index in sextic fields containing a cubic subfield. To illustrate the method we give a detailed example in the last section. AMS Classification Codes (2000...
متن کاملCryptography over Sextic Extension with Cubic Subfield
UPLICkey cryptographic is the fundamental technology in secure communications. It was devised by Diffie and Hellman [8], in 1976, to secret key distribution. In 1985, Coblitz [5] and Miller [7] independently proposed the implementation of a public key cryptosystem [3] using elliptic curve. The elliptic curve discrete logarithm problem appeared to be much more difficult than above discussed algo...
متن کاملPower integral bases in sextic fields with a cubic subfield
In the present paper we give an algorithm to compute generators of power integral bases having ”small” coordinates in an integral basis in sextic fields containing a cubic subfield. As an application of the method, we give a sufficient condition for infinite parametric families of number fields of this type to have power integral basis. To illustrate the statement we construct parametric famili...
متن کاملMultinomial combinatorial group representations of the octahedral and cubic symmetries
We consider the full multinomial combinatorics of all irreducible representations of the octahedral (cubic) symmetry as a function of partitions for vertex, face and edge colorings. Full combinatorial tables for all irreducible representations and all multinomial partitions are constructed. These enumerations constitute multinomial expansions of character-based cycle index polynomials, and grow...
متن کاملAsymptotic Number of General Cubic Graphs with given Connectivity
Let g(2n, l, d) be the number of general cubic graphs on 2n labeled vertices with l loops and d double edges. We use inclusion and exclusion with two types of properties to determine the asymptotic behavior of g(2n, l, d) and hence that of g(2n), the total number of general cubic graphs of order 2n. We show that almost all general cubic graphs are connected. Moreover, we determined the asymptot...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Number Theory
سال: 2016
ISSN: 0022-314X
DOI: 10.1016/j.jnt.2016.03.004